Parsing Complex Sentences with Structured Connectionist Networks

نویسنده

  • Ajay N. Jain
چکیده

A modular, recurrent connectionist network is taught to incrementally parse complex sentences. From input presented one word at a time, the network learns to do semantic role assignment, noun phrase attachment, and clause structure recognition, for sentences with both active and passive constructions and center-embedded clauses. The network makes syntactic and semantic predictions at every step. Previous predictions are revised as expectations are confirmed or violated with the arrival of new information. The network induces its own "grammar rules" for dynamically transforming an input sequence of words into a syntactickernantic interpretation. The network generalizes well and is tolerant of ill-formed inputs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incremental Parsing by Modular Recurrent Connectionist Networks

We present a novel, modular, recurrent connectionist network architecture which learns to robustly perform incremental parsing of complex sentences. From sequential input, one word at a time, our networks learn to do semantic role assignment, noun phrase attachment, and clause structure recognition for sentences with passive constructions and center embedded clauses. The networks make syntactic...

متن کامل

A Connectionist Parser with Recursive Sentence Structure and Lexical Disambiguation

In order to be taken seriously, connectionist natural language processing systems must be able to parse syntactically complex sentences. Current connectionist parsers either ignore structure or impose prior restrictions on the structural complexity of the sentences they can process | either number of phrases or the \depth" of the sentence structure. XERIC networks, presented here, are distribut...

متن کامل

Structure in Connectionist NLP

In order to be taken seriously, connectionist natural language processing systems must be able to parse syntactically complex sentences. Current connectionist parsers either ignore structure or impose prior restrictions on the structural complexity of the sentences they can process either number of phrases or the “depth” of the sentence structure. XERIC networks, presented here, are distributed...

متن کامل

A Modular Connectionist Parser for Resolution of Pronominal Anaphoric References in Multiple Sentences

In this work a connectionist model used in the resolution of a well-known linguistic phenomenon as pronominal anaphoric reference is presented. The model is composed of two neural networks: a simple recurrent neural network (parser) and a feedforward neural network (segmenter). These networks are trained and tested simultaneously. With this model it is possible to solve anaphoric references wit...

متن کامل

Deterministic Parsing of English: A Case for Sub-Symbolic Learning

A Connectionist Deterministic Parser (CDP) extends previous symbolic work by introducing a subsymbolic component to replace the English parsing rules . Learning is achieved in the neural network through backward error propagation . A more robust parser is the result one which is capable of processing a wider variety of sentence forms. Data are presented which demonstrate its capabilities for pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Neural Computation

دوره 3  شماره 

صفحات  -

تاریخ انتشار 1991